Random subspaces for encryption based on a private shared Cartesian frame

نویسندگان

  • Stephen D. Bartlett
  • Patrick Hayden
  • Robert W. Spekkens
چکیده

A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum capacities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Private Key based query on encrypted data

Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...

متن کامل

Frameness bound for frame of subspaces

In this paper, we show that in each nite dimensional Hilbert space, a frame of subspaces is an ultra Bessel sequence of subspaces. We also show that every frame of subspaces in a nite dimensional Hilbert space has frameness bound.

متن کامل

USING FRAMES OF SUBSPACES IN GALERKIN AND RICHARDSON METHODS FOR SOLVING OPERATOR EQUATIONS

‎In this paper‎, ‎two iterative methods are constructed to solve the operator equation $ Lu=f $ where $L:Hrightarrow H $ is a bounded‎, ‎invertible and self-adjoint linear operator on a separable Hilbert space $ H $‎. ‎ By using the concept of frames of subspaces‎, ‎which is a generalization of frame theory‎, ‎we design some  algorithms based on Galerkin and Richardson methods‎, ‎and then we in...

متن کامل

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

A Mutual Authentication Method for Internet of Things

Today, we are witnessing the expansion of various Internet of Things (IoT) applications and services such as surveillance and health. These services are delivered to users via smart devices anywhere and anytime. Forecasts show that the IoT, which is controlled online in the user environment, will reach 25 billion devices worldwide by 2020. Data security is one of the main concerns in the IoT. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005